#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>

using namespace std;
using LL = long long;

/*
construct the question into inserting
1: insert into two side   cnt += 1
2: insert into the place between two things     cnt += 2
3: insert into the place that have been inserted  cnt += 0
*/

int main(){
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int a, b, x;

    cin >> a >> b >> x;
    
    int tag = a > b;
    int nums = min(a, b) + 1;
    int cnt = max(a, b);
    vector<int> f(nums, 0);

    for(int i = 1; i <= f.size() - 2; i ++){
        if(x >= 2){
            x -= 2;
            f[i] ++;
            cnt --;
        }
    }

    if(x) f[0] ++, cnt --, x --;
    if(x) f[f.size() - 1] ++, cnt --, x --;
  //  cout << "tag: " << tag << '\n';
    for(int i = 0; i < f.size(); i ++){
        if(f[i]){
            for(int j = 1; j <= cnt; j ++) cout << !tag;
            cnt = 0;
        }
        for(int j = 0; j < f[i]; j ++) cout << !tag;


        if(i == f.size() - 1) continue;
        cout << tag ;
    }



    return 0;
}